package stu.day19_day24.day21;

public class LeetCode704 {
    public int search(int[] nums, int target) {
        int left = 0;
        int right = nums.length;
        int mid;
        while (left<right){
            mid = (left+right)/2;
            if(nums[mid]==target){
                return mid;
            }

            if(nums[mid]>=target){
                right = mid;
            } else if (nums[mid]<target) {
                left = mid+1;
            }
        }


        return -1;

    }
}
